Algebraic construction of cryptographically good binary linear transformations
نویسندگان
چکیده
MaximumDistance Separable (MDS) andMaximumDistance Binary Linear (MDBL) codes are used as diffusion layers in the design of the well-known block ciphers like the Advanced Encryption Standard, Khazad, Camellia, and ARIA. The reason for the use of these codes in the design of block ciphers is that they provide optimal diffusion effect to meet security of a round function of a block cipher. On the other hand, the constructions of these diffusion layers are various. For example, whereas the Advanced Encryption Standard uses a 4 4 MDS matrix over GF(2), ARIA uses a 16 16 involutory binary matrix over GF(2). The most important cryptographic property of a diffusion layer is the branch number of that diffusion layer, which represents the diffusion rate and measures security against linear and differential cryptanalysis. Therefore, MDS andMaximum Distance Binary Linear codes, which providemaximum branch number for a diffusion layer, are preferred in the design of block ciphers as diffusion layers. In this paper, we present a new algebraic construction method based on MDS codes for 8 8 and 16 16 involutory and non-involutory binary matrices of branch numbers 5 and 8, respectively. By using this construction method, we also show some examples of these diffusion layers. Copyright © 2012 John Wiley & Sons, Ltd.
منابع مشابه
Addendum to: "Infinite-dimensional versions of the primary, cyclic and Jordan decompositions", by M. Radjabalipour
In his paper mentioned in the title, which appears in the same issue of this journal, Mehdi Radjabalipour derives the cyclic decomposition of an algebraic linear transformation. A more general structure theory for linear transformations appears in Irving Kaplansky's lovely 1954 book on infinite abelian groups. We present a translation of Kaplansky's results for abelian groups into the terminolo...
متن کاملNew binary linear codes from algebraic curves
Many new binary linear codes (compared with Brouwer’s table) are found from a construction based on algebraic curves over finite fields.
متن کاملCryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity
Algebraic attack has recently become an important tool in cryptanalysing different stream and block cipher systems. A Boolean function, when used in some cryptosystem, should be designed properly to resist this kind of attack. The cryptographic property of a Boolean function, that resists algebraic attack, is known as Algebraic Immunity (AI). So far, the attempt in designing Boolean functions w...
متن کاملComputing the regularization of a linear differential-algebraic system
We study the regularization problem for linear differential-algebraic systems. As an improvement of former results we show that any system can be regularized by a combination of state-space and input-space transformations, behavioral equivalence transformations and a reorganization of variables. The additional state feedback which is needed in earlier publications is shown to be superfluous. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Security and Communication Networks
دوره 7 شماره
صفحات -
تاریخ انتشار 2014